The Wadge Hierarchy of Max-Regular Languages
نویسندگان
چکیده
Recently, Mikołaj Bojańczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new class can be seen as a different way of generalizing the notion of regularity from finite to infinite words. This paper compares regular and max-regular languages in terms of topological complexity. It is proved that up to Wadge equivalence the classes coincide. Moreover, when restricted to ∆2-languages, the classes contain virtually the same languages. On the other hand, separating examples of arbitrary complexity exceeding ∆2 are constructed.
منابع مشابه
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]
We provide a hierarchy of tree languages recognised by nondeterministic parity tree automata with priorities in {0, 1, 2}, whose length exceeds the first fixed point of the ε operation (that itself enumerates the fixed points of x 7→ ω). We conjecture that, up to Wadge equivalence, it exhibits all regular tree languages of index [0, 2].
متن کاملThe Wadge Hierarchy of Petri Nets ω-Languages
We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height ω 2 , and giv...
متن کاملω-Semigroups and the Fine Classification of Borel Subsets of Finite Ranks of the Cantor Space
The algebraic study of formal languages draws the equivalence between ω-regular languages and subsets of finite ω-semigroups. The ω-regular languages being the ones characterised by second order monadic formulas. Within this framework, in [1]we provide a characterisation of the algebraic counterpart of the Wagner hierarchy: a celebrated hierarchy of ω-regular languages. For this, we adopt a hie...
متن کاملThe Wadge Hierarchy of Deterministic Tree Languages
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another. This extends Wagner’s results on the hierarchy of ω-regular languages of words to the case of trees.
متن کاملAn upper bound on the complexity of recognizable tree languages
The third author noticed in his 1992 PhD Thesis [Sim92] that every regular tree language of infinite trees is in a class a(Dn(Σ2)) for some natural number n ≥ 1, where a is the game quantifier. We first give a detailed exposition of this result. Next, using an embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space 2 into the class ∆2, and the notions of Wadge degree...
متن کامل